An O(n) Distributed Deadlock Resolution Algorithm: Correctness Proof
نویسندگان
چکیده
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n − 1 messages and a latency of n ·T for a deadlock cycle of n processes, where T is the inter-site communication delay. The algorithm achieves this improvement even satisfying the strongest correctness criteria considered in previous works: it resolves all deadlocks in finite time and does not resolve false deadlocks.
منابع مشابه
Formal Veri cation of Distributed Deadlock Detection Algorithm Using a Time-dependent Proof Technique
A large number of published distributed deadlock detection/resolution algorithms are found to be incorrect because they have used informal approaches to prove the correctness of their algorithms. In this paper, we present a formal approach for the correctness proof and give an example of the proof. In this proposed approach, a formal model of distributed deadlock is presented with a local-time ...
متن کاملEfficient algorithms for detection and resolution of distributed deadlocks
We present a simple and efficient distributed algorithm for detecting generalized-deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-€or graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an “image” of the WF...
متن کاملComparing factor Bracha -
We present a simple and eecient distributed algorithm for detecting generalized-deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-for graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an \image" of the WFG ...
متن کاملFormal Model and Speciication of Deadlock
In this paper, we present a formal model of deadlock in a distributed system and develop the deadlock speciication in terms of time-dependent predicates. Primitive activities of processes in the distributed system are speciied by the predicates so that system behaviors can be described by logic operations. With the formal model, we have an insight into the deenition of deadlock in local views. ...
متن کاملYet Another Correctness Criterion for Multiplicative Linear Logic with MIX
A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical ow of information inside a proof, that is, roughly, a distribut...
متن کامل